Non-Redundant Implicational Base of Many-Valued Context Using SAT

نویسندگان

چکیده

Some attribute implications in an implicational base of a derived context many-valued can be inferred from some other together with its scales. The scales are interpretation values the therefore they prior or existing knowledge. In knowledge discovery, such redundant and cannot considered as new Therefore should eliminated. This paper shows that redundancy problem exists formalizes model to check redundancy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attribute Exploration of Many-Valued Context with SAT

This paper proposes an encoding a background-implying problem in attribute exploration of manyvalued context into a SAT problem. A background-implying problem is whether an attribute implication is implied by some other attribute implications and is also compatible with background knowledge. In the case of manyvalued context, the background knowledge will be its scales which are also formal con...

متن کامل

Many-Valued Context Analysis Using Descriptions

We propose an approach to many-valued contexts using formal descriptions instead of scaling. The underlying idea is the philosphical definition of a concept as a set of objects together with the most precise description. We introduce a formal description as a mapping from the set of attributes to the power set of the values (which is extended appropriately to empty cells), assigning to each att...

متن کامل

Mapping CSP into Many-Valued SAT

We first define a mapping from CSP to many-valued SAT which allows to solve CSP instances with many-valued SAT solvers. Second, we define a new many-valued resolution rule and prove that it is refutation complete for many-valued CNF formulas and, moreover, enforces CSP (i, j)-consistency when applied to a many-valued SAT encoding of a CSP. Instances of our rule enforce well-known local consiste...

متن کامل

Extending the Reach of SAT with Many-Valued Logics

We present Regular-SAT, an extension of Boolean Satisfiability based on a class of many-valued CNF formulas. Regular-SAT shares many properties with Boolean SAT, which allows us to generalize some of the best known SAT results and apply them to Regular-SAT. In addition, Regular-SAT has a number of advantages over Boolean SAT. Most importantly, it produces more compact encodings that capture pro...

متن کامل

Many Valued Context for Knowledge Evaluation

In this paper we illustrate application of many valued context in the area of knowledge evaluation. While the classical binary approach clearly indicates relationships among objects and attributes it still does not provide any information on the degrees to which an object possesses an attribute. Many valued contexts allow inclusion of more detailed description on such dependences. Key–Words: Ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computing and informatics

سال: 2021

ISSN: ['1335-9150', '2585-8807']

DOI: https://doi.org/10.31577/cai_2021_2_368